Why Local Search Excels in Expression Simplification

A Dynamic Model of Tabu Search for the Job-Shop Scheduling Problem

Although tabu search is one of the most effective meta-heuristics for solving the job-shop scheduling problem (JSP), very little is known about why this approach works so well and under what conditions it excels. Our goal is to develop models of tabu search algorithms for the JSP that answer these and other related research questions. We previously demonstrated that the mean distance between ra...

Biclustering Using Message Passing

Biclustering is the analog of clustering on a bipartite graph. Existent methods infer biclusters through local search strategies that find one cluster at a time; a common technique is to update the row memberships based on the current column memberships, and vice versa. We propose a biclustering algorithm that maximizes a global objective function using message passing. Our objective function c...

Why Can We See a Local Spread of Chikungunya Virus (CHIKV) Infection?

A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network

Abstract   Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...

Searching in the Presence of Noise

In this paper, we examine the eeects of noise on both local search and genetic search. Understanding the potential eeects of noise on a search space may explain why some search techniques fail and why others succeed in the presence of noise. We discuss two eeects that are the result of adding noise to a search space: the annealing of peaks in the search space and the introduction of false local...